Asymptotic existence of proportionally fair allocations

نویسنده

  • Warut Suksompong
چکیده

Fair division has long been an important problem in the economics literature. In this note, we consider the existence of proportionally fair allocations of indivisible goods, i.e., allocations of indivisible goods in which every agent gets at least her proportionally fair share according to her own utility function. We show that when utilities are additive and utilities for individual goods are drawn independently at random from a distribution, proportionally fair allocations exist with high probability if the number of goods is a multiple of the number of agents or if the number of goods grows asymptotically faster than the number of agents.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods

Max-min fair allocations and proportionally fair allocations are desirable outcomes in a fair division of indivisible goods. Unfortunately, such allocations do not always exist, not even in very simple settings with few agents. A natural question is to ask about the largest value c for which there is an allocation such that every agent has utility of at least c times her fair share. Our goal is...

متن کامل

Insensitive, maximum stable allocations converge to proportional fairness

We describe a queueing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queueing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a propo...

متن کامل

Bandwidth sharing: objectives and algorithms

. 4 b s h c t This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled max-min fairness: F . Kelly [IO] has recently introduced the alternative proportional fairness criterion; we introduce a third criterion. which is naturally interpreted in terms of the delays experienced by ongoing t...

متن کامل

Positive results for mechanism design without money

Consider the problem of allocating multiple divisible goods to two agents in a strategy-proof fashion without the use of payments or priors. Previous work [1, 2] has aimed at implementing allocations that are competitive with respect to an appropriately defined measure of social welfare. These results have mostly been negative, proving that no dictatorial mechanism can achieve an approximation ...

متن کامل

On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel

The capacity region of a channel consists of all achievable rate vectors. Picking a particular point in the capacity region is synonymous with rate allocation. The issue of fairness in rate allocation is addressed in this paper. We review several notions of fairness, including max-min fairness, proportional fairness and Nash bargaining solution. Their efficiencies for general multiuser channels...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2016